翻訳と辞書 Words near each other ・ Literacy in Romania ・ Literacy in the United States ・ Literacy in Tokelau ・ Literacy Is Empowering Project ・ Literacy test ・ Literacy Training Service ・ Literacy Volunteers of Illinois ・ Literae Humaniores ・ Literal ・ Literal (computer programming) ・ Literal (magazine) ・ Literal (mathematical logic) ・ Literal and figurative language ・ Literal contracts in Roman law ・ Literal Latte ・ Literal movement grammar ・ Literal music video ・ Literal pool ・ Literal translation ・ Literalism ・ Literariness ・ Literarische Donaugesellschaft ・ Literary activism ・ Literary adaptation ・ Literary agent ・ Literary and colloquial readings of Chinese characters ・ Literary and Debating Society (NUI Galway) ・ Literary and Historical Society ・ Literary and Historical Society (University College Dublin) ・ Literary and Historical Society of Quebec Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Literal movement grammar ： ウィキペディア英語版 Literal movement grammar Literal movement grammars (LMGs) are a grammar formalism introduced by Groenink in 1995〔Groenink, Annius V. 1995. Literal Movement Grammars. In ''Proceedings of the 7th EACL Conference''.〕 intended to characterize certain extraposition phenomena of natural language such as topicalization and cross-serial dependencies. LMGs extend the class of CFGs by adding introducing pattern-matched function-like rewrite semantics, as well as the operations of variable binding and slash deletion. ==Description== The basic rewrite operation of an LMG is very similar to that of a CFG, with the addition of "arguments" to the non-terminal symbols. Where a context-free rewrite rule obeys the general schema $S\; \backslash to\; \backslash alpha$ for some non-terminal $S$ and some string of terminals and/or non-terminals $\backslash alpha$, an LMG rewrite rule obeys the general schema $X(x\_1,\; ...,\; x\_n)\; \backslash to\; \backslash alpha$, where X is a non-terminal with arity n (called a predicate in LMG terminology), and $\backslash alpha$ is a string of "items", as defined below. The arguments $x\_i$ are strings of terminal symbols and/or variable symbols defining an argument pattern. In the case where an argument pattern has multiple adjacent variable symbols, the argument pattern will match any and all partitions of the actual value that unify. Thus, if the predicate is $f(xy)$ and the actual pattern is $f(ab)$, there are three valid matches: $x\; =\; \backslash epsilon,\backslash \; y\; =\; ab;\backslash \; x\; =\; a,\backslash \; y\; =\; b;\backslash \; x\; =\; ab,\backslash \; y\; =\; \backslash epsilon$. In this way, a single rule is actually a family of alternatives. An "item" in a literal movement grammar is one of * $f(x\_1,\; \backslash ldots,\; x\_n)$, a predicate of arity n, * $x\; \backslash textf(x\_1,\; \backslash ldots,\; x\_n)$, a variable binding x to the string produced by $f(x\_1,\; ...,\; x\_n)$, or * $f(x\_1,\; \backslash ldots,\; x\_n)/\backslash alpha$, a slash deletion of $f(x\_1,\; ...,\; x\_n)$ by the string of terminals and/or variables $\backslash alpha$. In a rule like $f(x\_1,\; ...,\; x\_m)\; \backslash to\; \backslash alpha\backslash \; y\; \backslash text\; g(z\_1,\; ...\; z\_n)\backslash \; \backslash beta$, the variable y is bound to whatever terminal string the g predicate produces, and in $\backslash alpha$ and $\backslash beta$, all occurrences of y are replaced by that string, and $\backslash alpha$ and $\backslash beta$ are produced as if terminal string had always been there. An item $x/y$, where x is something that produces a terminal string (either a terminal string itself or some predicate), and y is a string of terminals and/or variables, is rewritten as the empty string ($\backslash epsilon$) if and only if $g(y\_1,\; ...,\; y\_n)\; =\; z$, and otherwise cannot be rewritten at all. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Literal movement grammar」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.